This paper presents the implementation of a self-replicating finite-state machine (FSM) and a self-replicating Turing Machine (TM) using bio-inspired mechanisms. Building on previous work that introduced self-replicating structures capable of sorting, copying, and reading information, this study demonstrates the computational power of these mechanisms by explicitly constructing a functioning FSM and TM. This study demonstrates the universality of the system by emulating the UTM(5,5) of Neary and Woods.

It is well known that Sch\"onhage's Storage Modification Machines (SMM) can simulate Turing Machines (TM) since Sch\"onhage's original proof of the Turing completeness of the eponymous machines. We propose a simple transformation of TM into SMM, setting the base for a straightforward TM-to-SMM compiler.

The'unfolding argument' presented in [1] made the case that IIT and other causal structure theories (CSTs) are either already falsified or outside the realm of science. This argument was first extended in [2] and a more generalized version was presented as the'substitution arguments' in [3].The author here will assume that readers are pretty familiar with all 3 papers -[1], [2] and [3]. The focus will be on the last one which we find to be the most general version of the arguments and the most broad in claims. It is very interesting work, accessible and proposes a descriptive mathematical framework that could be very useful moving forward. For the sake of brevity, we will borrow the symbols and terminologies from [3] as much as possible to point out the errors in that model and make suitable corrections. With these corrections incorporated, we should be able see that the substitutions argument does not apply for functionalist theories (or at best have not been proven to do so) in [3]. In this short note, we will start by introducing some relevant concepts and definitions from [3] in section 2. The main contribution of this note is section 3, where we present arguments as to why the results of the substitution argument does not apply for functionalist theories of consciousness by pointing what the formalism missed. The note will conclude in section 4 summarizing the ideas presented here.

The Universal Turing Machine (TM) is a model for VonNeumann computers --- general-purpose computers. A human brain can inside-skull-automatically learn a universal TM so that he acts as a general-purpose computer and writes a computer program for any practical purposes. It is unknown whether a machine can accomplish the same. This theoretical work shows how the Developmental Network (DN) can accomplish this. Unlike a traditional TM, the TM learned by DN is a super TM --- Grounded, Emergent, Natural, Incremental, Skulled, Attentive, Motivated, and Abstractive (GENISAMA). A DN is free of any central controller (e.g., Master Map, convolution, or error back-propagation). Its learning from a teacher TM is one transition observation at a time, immediate, and error-free until all its neurons have been initialized by early observed teacher transitions. From that point on, the DN is no longer error-free but is always optimal at every time instance in the sense of maximal likelihood, conditioned on its limited computational resources and the learning experience. This letter also extends the Church-Turing thesis to automatic programming for general purposes and sketchily proved it.

Imagine that a budding composer suffers from writer's block partway through devising a melody. A system called FreshJam is demonstrated, which offers a solution to this problem in the form of an interactive composition assistant; an algorithm that analyzes the notes composed so far, makes a comparison with an indexed corpus of existing music, and suggests a possible next note by choosing randomly among continuations of matched melody fragments. We provide a demonstration of FreshJam as an aid in stylistic composition, and of its potential to be more iterative than existing composition assistants such as PG Music's Band in a Box or Microsoft's Songsmith.

We describe a recurrent connectionist network, called CONCERT, that uses a set of melodies written in a given style to compose new melodies in that style. CONCERT is an extension of a traditional algorithmic composition technique in which transition tables specify the probability of the next note as a function of previous context. A central ingredient of CONCERT is the use of a psychologically-grounded representation of pitch.

We describe a recurrent connectionist network, called CONCERT, that uses a set of melodies written in a given style to compose new melodies in that style. CONCERT is an extension of a traditional algorithmic composition technique in which transition tables specify the probability of the next note as a function of previous context. A central ingredient of CONCERT is the use of a psychologically-grounded representation of pitch.

We describe a recurrent connectionist network, called CONCERT, that uses a set of melodies written in a given style to compose new melodies in that style. CONCERT is an extension of a traditional algorithmic composition technique inwhich transition tables specify the probability of the next note as a function of previous context. A central ingredient of CONCERT is the use of a psychologically-grounded representation of pitch.